Lecture 16 — November 6 th , 2012 ( Prasad Raghavendra )
نویسنده
چکیده
In this lecture, we will begin to talk about the “PCP Theorem” (Probabilistically Checkable Proofs Theorem). Since the discovery of NP-completeness in 1972, researchers had mulled over the issue of whether we can efficiently compute approximate solutions to NP-hard optimization problems. They failed to design such approximate algorithms for most problems. They then tried to show that computing approximate solutions is also hard, but apart from a few isolated successes this effort also stalled. Researchers slowly began to realize that the Cook-Levin-Karp-style reductions do not suffice to prove any limits on approximation algorithms [1].
منابع مشابه
6.s897 Algebra and Computation Lecture 24
In this lecture we will develop a construction of locally decodable codes developed in three papers by Yekhanin, Raghavendra, and Eframenko respectively (and chronologically). Yekhanin constructed a family of binary locally decodable codes with a 3-query decoding algorithm based on Mersenne primes. Raghavendra simplified Yekhanin’s construction and extended the ideas beyond binary alphabets. Th...
متن کاملFinding Sparse Cuts via Cheeger Inequalities for Higher Eigenvalues
Cheeger’s fundamental inequality states that any edge-weighted graph has a vertex subset S such that its expansion (a.k.a. conductance of S or the sparsity of the cut (S, S̄)) is bounded as follows: φ(S) def = w(S, S̄) min{w(S), w(S̄)} 6 √ 2λ2, where w is the total edge weight of a subset or a cut and λ2 is the second smallest eigenvalue of the normalized Laplacian of the graph. We study three nat...
متن کاملTowards computing the Grothendieck constant
The Grothendieck constant KG is the smallest constant such that for every d ∈ N and every matrix A = (aij),
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012